On optimal approximability results for computing the strong metric dimension
نویسندگان
چکیده
In this short note, we observe that the problem of computing the strong metric dimension of a graph can be reduced to the problem of computing a minimum node cover of a transformed graph within an additive logarithmic factor. This implies both a 2-approximation algorithm and a (2−ε)-inapproximability for the problem of computing the strong metric dimension of a graph.
منابع مشابه
On the (adjacency) metric dimension of corona and strong product graphs and their local variants: Combinatorial and computational results
The metric dimension is quite a well-studied graph parameter. Recently, the adjacency metric dimension and the local metric dimension have been introduced. We combine these variants and introduce the local adjacency metric dimension. We show that the (local) metric dimension of the corona product of a graph of order n and some non-trivial graph H equals n times the (local) adjacency metric dime...
متن کاملComplexity and Approximability of Certain Bicriteria Location Problems
We investigate the complexity and approximability of some location problems when two distance values are speciied for each pair of potential sites. These problems involve the selection of a speciied number of facilities (i.e. a placement of a speciied size) to minimize a function of one distance metric subject to a budget constraint on the other distance metric. Such problems arise in several a...
متن کاملOn the strong metric dimension of corona product graphs and join graphs
Let G be a connected graph. A vertex w strongly resolves a pair u, v of vertices of G if there exists some shortest u− w path containing v or some shortest v − w path containing u. A set W of vertices is a strong resolving set for G if every pair of vertices of G is strongly resolved by some vertex of W . The smallest cardinality of a strong resolving set for G is called the strong metric dimen...
متن کاملApproximability of nonlinear affine control systems
This paper focuses on a strong approximability property for nonlinear affine control systems.We consider control processes governed by ordinary differential equations (ODEs) and study an initial systemand the associated generalized system.Our theoretical approach makes it possible to prove a strong approximability result for the above dynamical systems. The latter can be effectively applied to ...
متن کاملOn two-dimensional Cayley graphs
A subset W of the vertices of a graph G is a resolving set for G when for each pair of distinct vertices u,v in V (G) there exists w in W such that d(u,w)≠d(v,w). The cardinality of a minimum resolving set for G is the metric dimension of G. This concept has applications in many diverse areas including network discovery, robot navigation, image processing, combinatorial search and optimization....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 221 شماره
صفحات -
تاریخ انتشار 2017